On open problems in polling systems
نویسندگان
چکیده
منابع مشابه
On open problems in polling systems
In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals with a system consisting of two queues, one of which has gated service, while the other receives 1-limited service. The second open problem concerns polling systems with g...
متن کاملwind farm impact on generation adequacy in power systems
در سال های اخیر به دلیل افزایش دمای متوسط کره زمین، بشر به دنبال روش های جایگزین برای تامین توان الکتریکی مورد نیاز خود بوده و همچنین در اکثر نقاط جهان سوزاندن سوخت های فسیلی در نیروگاه های حرارتی به عنوان مهم ترین روش تولید توان الکتریکی مطرح بوده است. به دلیل توجه به مسایل زیست محیطی، استفاده از منابع انرژی تجدید پذیر در سال های اخیر شدت یافته است. نیروگاه های بادی به عنوان یک منبع تولید توان...
15 صفحه اولScheduling in polling systems
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling system...
متن کاملDynamic Routing in Polling Systems
Polling systems have important applications to Telecommunication Systems, Data Link Protocols, Local Area Computer Networks, Flexible Manufacturing Systems, etc. As such they have been the subject of extensive research in recent years, most notably in the context of cyclic queues. The focus of much of this research has been on evaluating performance measures of fixed-template routing schemes wi...
متن کاملOn the Optimal Open-loop Control Policy for Deterministic and Exponential Polling Systems
In this article, we consider deterministic ~both fluid and discrete! polling systems with N queues with infinite buffers and we show how to compute the best polling sequence ~minimizing the average total workload!+ With two queues, we show that the best polling sequence is always periodic when the system is stable and forms a regular sequence+ The fraction of time spent by the server in the fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2011
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-011-9247-9